منابع مشابه
Variants of P Systems with Toxic Objects
Toxic objects have been introduced to avoid trap rules, especially in (purely) catalytic P systems. No toxic object is allowed to stay idle during a valid derivation in a P system with toxic objects. In this paper we consider special variants of toxic P systems where the set of toxic objects is predefined – either by requiring all objects to be toxic or all catalysts to be toxic or all objects ...
متن کاملEilenberg P Systems with Symbol-Objects
A class of P systems, called EOP systems, with symbol objects processed by evolution rules distributed alongside the transitions of an Eilenberg machine, is introduced. A parallel variant of EOP systems, called EOPP systems, is also defined and the power of both EOP and EOPP systems is investigated in relationship with three parameters: number of membranes, states and set of distributed rules. ...
متن کاملUniform metrical task systems with a limited number of states
We give a randomized algorithm (the ”Wedge Algorithm”) of competitiveness 3 2 Hk − 1 2k for any metrical task system on a uniform space of k points, for any k ≥ 2, where Hk = P k i=1 1 i , the k harmonic number. This algorithm has better competitiveness than the Irani-Seiden algorithm if k is smaller than 10. The algorithm is better by a factor of 2 if k < 47.
متن کاملP Systems with String Objects and with Communication by Request
In this paper we study P systems using string-objects where the communication between the regions is indicated by the occurrence of so-called query symbols in the string. We define two variants of communication and prove that these systems with both types of communication are computationally complete, even having a number of membranes limited with relatively small constants.
متن کاملComputing with Membranes: P Systems with Worm-Objects
We consider a combination of P systems with objects described by symbols with P systems with objects described by strings. Namely, we work with multisets of strings and consider as the result of a computation the number of strings in a given output membrane. The strings (also called worms) are processed by replication, splitting, mutation, and recombination; no priority among rules and no other...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Membrane Computing
سال: 2021
ISSN: 2523-8906,2523-8914
DOI: 10.1007/s41965-020-00068-6